Information and Its Metric
نویسنده
چکیده
Information is taken as the primary physical entity from which probabilities can be derived. Information produced by a source is defined as the class of sources that are recodingequivalent. Shannon entropy is one of a family of formal Renyi information measures on the space of unique sources. Each of these measures quantifies the volume of the source’s recoding-equivalence class. A space of information sources is constructed from elements each of which is the class of recoding-equivalent, but otherwise unique sources. The norm in this space is the source entropy. A measure of distance between information sources is derived from an algebra of measurements. With this, the space of information sources is shown to be a metric space whose logic is described by a metric lattice. Applications of the information metric to quantum informational uncertainty and to information densities in multicomponent dynamical systems are outlined.
منابع مشابه
An Effective Approach for Robust Metric Learning in the Presence of Label Noise
Many algorithms in machine learning, pattern recognition, and data mining are based on a similarity/distance measure. For example, the kNN classifier and clustering algorithms such as k-means require a similarity/distance function. Also, in Content-Based Information Retrieval (CBIR) systems, we need to rank the retrieved objects based on the similarity to the query. As generic measures such as ...
متن کاملINTUITIONISTIC FUZZY QUASI-METRIC AND PSEUDO-METRIC SPACES
In this paper, we propose a new definition of intuitionistic fuzzyquasi-metric and pseudo-metric spaces based on intuitionistic fuzzy points. Weprove some properties of intuitionistic fuzzy quasi- metric and pseudo-metricspaces, and show that every intuitionistic fuzzy pseudo-metric space is intuitionisticfuzzy regular and intuitionistic fuzzy completely normal and henceintuitionistic fuzzy nor...
متن کاملComposite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملیادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیکهای یادگیری معیار فاصله
Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...
متن کاملAlgebraic distance in algebraic cone metric spaces and its properties
In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.
متن کاملThe Existence Theorem for Contractive Mappings on $wt$-distance in $b$-metric Spaces Endowed with a Graph and its Application
In this paper, we study the existence and uniqueness of fixed points for mappings with respect to a $wt$-distance in $b$-metric spaces endowed with a graph. Our results are significant, since we replace the condition of continuity of mapping with the condition of orbitally $G$-continuity of mapping and we consider $b$-metric spaces with graph instead of $b$-metric spaces, under which can be gen...
متن کامل